Combinatorial Auctions, Knapsack Problems, and Hill-Climbing Search
نویسنده
چکیده
This paper examines the performance of hill climbing algo rithms on standard test problems for combinatorial auctions CAs On single unit CAs deterministic hill climbers are found to perform well and their performance can be improved signi cantly by randomizing them and restarting them several times or by using them collectively For some problems this good performance is shown to be no better than chan cel on others it is due to a well chosen scoring function The paper draws attention to the fact that multi unit CAs have been studied widely un der a di erent name multidimensional knapsack problems MDKP On standard test problems for MDKP one of the deterministic hill climbers generates solutions that are on average of the best known solutions
منابع مشابه
Combinatorial Auctions , Knapsack Problems , and Hill - climbing
This paper examines the performance of hill-climbing algorithms on standard test problems for combinatorial auctions (CAs). On single-unit CAs, deterministic hill-climbers are found to perform well, and their performance can be improved signiicantly by randomizing them and restarting them several times, or by using them collectively. For some problems this good performance is shown to be no bet...
متن کاملThe COMPSET Algorithm for Subset Selection
Subset selection problems are relevant in many domains. Unfortunately, their combinatorial nature prohibits solving them optimally in most cases. Local search algorithms have been applied to subset selection with varying degrees of success. This work presents COMPSET, a general algorithm for subset selection that invokes an existing local search algorithm from a random subset and its complement...
متن کاملModified Choice Function Heuristic Selection for the Multidimensional Knapsack Problem
Hyper-heuristics are a class of high-level search methods used to solve computationally difficult problems, which operate on a search space of low-level heuristics rather than solutions directly. Previous work has shown that selection hyper-heuristics are able to solve many combinatorial optimisation problems, including the multidimensional 0-1 knapsack problem (MKP). The traditional framework ...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملComparison of Heuristic Algorithms in Functions Optimization and Knapsack Problem
This paper addresses the comparison of heuristic algorithms in the case of real functions optimization and knapsack problem. Metaheuristics for algorithms hill climbing, simulated annealing, tabu search and genetic algorithm are shown, test results are presented and conclusions are drawn. Input parameters for optimization functions problem are optimised on a sample of functions. Also, algorithm...
متن کامل